Mediator Join Indices
نویسندگان
چکیده
A mediator join index (MJI) is proposed to speed up Nway inter-database joins by reducing the amount of data transfer during evaluation. A family of algorithms, the Query Scrubbing Algorithms (QSA), are developed to maintainMJI and to evaluate queries usingMJI. QSA algorithms use query scrubbing to cope with update and query anomalies related to materialized views in the mediator context. Compared with existing algorithms, QSA algorithms incur less overhead in handling the anomalies and makes MJI a promising technique for efficient mediator query processing.
منابع مشابه
Distance-Associated Join Indices for Spatial Range Search
Spatial join indices are join indices constructed for spatial objects. Similar to join indices for relational database systems, spatial join indices improve efficiency of spatial join operations. In this paper, a distanceassociated join index structure is developed to speed up spatial queries especially for spatial range queries. Three distance-associated join indexing mechanisms: basic, ring-s...
متن کاملAccelerating Spatial Join Operations using Bit-Indices
Spatial join is a very expensive operation in spatial databases. In this paper, we propose an innovative method for accelerating spatial join operations using Spatial Join Bitmap (SJB) indices. The SJB indices are used to keep track of intersecting entities in the joining data sets. We provide algorithms for constructing SJB indices and for maintaining the SJB indices when the data sets are upd...
متن کاملA study of nested-relational joins in mediator-based distributed environments
This thesis reports on the results of a study of the nested join operator in a mediator-based setting. As the rate at which data is accumulated increases, the need for integration of di erent (physical) Database Management Systems (DBMS) becomes apparent. The most fundamental and arguably important operation that is used in order to achieve this is the join-operator. The nested-relational model...
متن کاملA Data Mining Approach for selecting Bitmap Join Indices
Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap...
متن کاملAn Efficient Multi Join Algorithm Utilizing a Lattice of Double Indices
In this paper, a novel multi join algorithm to join multiple relations will be introduced. The novel algorithm is based on a hashed-based join algorithm of two relations to produce a double index. This is done by scanning the two relations once. But instead of moving the records into buckets, a double index will be built. This will eliminate the collision that can happen from a complete hash al...
متن کامل